Pre-emptive but safe interval caching for real-time multimedia systems

نویسندگان

  • KyungOh Lee
  • Yoon Young Park
  • Heon Young Yeom
چکیده

The fundamental problem in developing high-performance multimedia database servers is that images, audio and video data differ from numeric or text data in their characteristics, and hence require different handling techniques. Digital audio and video streams consist of a sequence of media quanta (video frames or audio samples) which convey meaning only when presented contiguously on time. In order to ensure continuous delivery of video or audio, reservation of various resources (e.g., disk bandwidth, memory, network bandwidth, etc.) is required before starting playback of a stream. The maximum bandwidth that can be reserved on each disk will depend on the number of concurrent streams it can support with an acceptable level of jitter or hiccup, i.e., without violating on-time delivery constraints. Read-ahead buffering, where blocks are read and buffered ahead of the time they are needed, has been introduced. Although early work on continuous media storage systems assumed separate buffers for each client, more recent work [11, 15] has assumed a global buffer cache, similar to buffer caches in traditional storage systems [10, 20] where the cached data can be shared among all the clients. The rationale for using a buffer cache for multimedia database systems is the same as that for traditional storage systems: namely, the reduction of disk I/O. Unlike in traditional systems, LRU does not yield a high cache hit ratio for multimedia data access [3]. In [6, 8, 16], a caching scheme for a video server has been proposed. The scheme exploits temporal locality accessing the same multimedia object, by caching intervals between successive streams (preceding stream and following stream), and is referred to as interval caching. If none of the cached intervals are replaced or preempted until they have finished their playback, the following streams of those intervals experience no hiccup without access to the disks. However, since the interval caching allows cache replacement, it cannot guarantee hiccup-free playback as in [17] if additional streams are admitted using the saved disk bandwidth. Ozden et al. proposed several schemes which improve the cache hit ratio in multimedia storage systems [17]. However, their cache replacement schemes cannot guarantee the hic-

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Caching Performance in Multimedia Servers

The design of multimedia servers faces significant challenges to support large numbers of concurrent customers because multimedia data require real-time playback and high transfer rates. These requirements impose heavy burdens on the underlying storage subsystems and lead to rapid consumptions of network bandwidth. Interval caching is an efficient way to reduce the disk bandwidth requirements i...

متن کامل

Fixed Priority Scheduling Theory for Hard Real-time Systems. in Foundations of Real-time Computing — Scheduling and Resource Management. Kluwer Academic Symbolic Model Checking for Event-driven Real-time Systems

In this work we propose a verification methodology consisting of selective quantitative analysis and interval model checking. Our methods can aid not only in determining if a system works correctly, but also in understanding how well the system works. The selective quantitative algorithms compute minimum and maximum delays over a selected subset of system executions. We use a formula of the lin...

متن کامل

Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet

1 Summary Caching is one common technique for enhancing the scalability of media streaming systems. However, current caching techniques are not aware of quality adaptation. To deal with this problem, Rejaie et al. (1999) proposed an adaptive multimedia caching mechanism for layered encoded multimedia streams. This mechanism includes two techniques. The first is a pre-fetch scheme that enables t...

متن کامل

On Optimal Priority Assignment for Response Time Analysis of Global Fixed Priority Pre-emptive Scheduling in Multiprocessor Hard Real-Time Systems

This paper investigates the problem of optimal priority assignment in multiprocessor real-time systems using global fixed task-priority pre-emptive scheduling. Previous work in this area showed that arguably the most effective pseudo-polynomial schedulability tests for global fixed priority pre-emptive scheduling, based on response time analysis, are not compatible with Audsley’s Optimal Priori...

متن کامل

Protocol Considerations for a Pre x-Caching Proxy for Multimedia Streams

The increasing popularity of multimedia streaming applications introduces new challenges in content distribution. Web-initiated multimedia streams typically experience high start-up delay, due to large protocol overheads and the poor delay, throughput, and loss properties of the Internet. Internet service providers can improve performance by caching the initial segment (the preex) of popular st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Syst. Sci. Eng.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2003